home *** CD-ROM | disk | FTP | other *** search
/ Power Programmierung 2 / Power-Programmierung CD 2 (Tewi)(1994).iso / c / library / dos / diverses / leda / incl / set.h < prev    next >
Encoding:
C/C++ Source or Header  |  1991-11-15  |  2.0 KB  |  69 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  2.1.1                                                 11-15-1991
  4. +
  5. +
  6. +  set.h
  7. +
  8. +
  9. +  Copyright (c) 1991  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16.  
  17.  
  18. #ifndef SETH
  19. #define SETH
  20.  
  21. //------------------------------------------------------------------------------
  22. // set             
  23. //
  24. // Stefan Naeher  (1989)
  25. //------------------------------------------------------------------------------
  26.  
  27. #include <LEDA/basic.h>
  28.  
  29. #ifndef RBTREEH 
  30. #include <LEDA/rb_tree.h>
  31. #endif
  32.  
  33. #define set(keytype) name2(keytype,set)
  34.  
  35. #define setdeclare(keytype)\
  36. \
  37. class set(keytype) : public rb_tree {\
  38. \
  39. rb_tree_node* iterator;\
  40. \
  41. int  cmp(ent& x, ent& y) const { return compare(*(keytype*)&x,*(keytype*)&y); }\
  42. void clear_key(ent& x)   const { Clear(*(keytype*)&x); }\
  43. void copy_key(ent& x)    const { Copy(*(keytype*)&x); }\
  44. \
  45. public:\
  46. void insert(keytype y)         { rb_tree::insert(Ent(y),0); }\
  47. void del(keytype y)            { rb_tree::del(Ent(y)); }\
  48. bool member(keytype y)   const { return (rb_tree::lookup(Ent(y))!=nil); }\
  49. keytype choose()         const { return keytype(rb_tree::key(rb_tree::min())); }\
  50. \
  51. void init_iterator()          { iterator = rb_tree::first_item(); }\
  52. bool next_element(keytype& y) { if (iterator==0) return false;\
  53.                                 else { void* p = rb_tree::key(iterator);\
  54.                                        y = *(keytype*)&p;\
  55.                                        iterator=rb_tree::next_item(iterator);\
  56.                                        return true; } \
  57.                                }\
  58. \
  59.  set(keytype)& operator=(const set(keytype)& S)\
  60.  { rb_tree::operator=((rb_tree&) S); return *this; }\
  61. \
  62.  set(keytype)() {}\
  63.  set(keytype)(const set(keytype)& S) : rb_tree((rb_tree&) S) {}\
  64. ~set(keytype)() { clear(); }\
  65. } ;
  66.  
  67. #endif
  68.  
  69.